Time dependent solution for acceleration of tau-leaping
نویسندگان
چکیده
The tau-leaping method is often effective for speeding up discrete stochasticsimulation of chemically reacting systems. However, when fast reactions areinvolved, the speed-up for this method can be quite limited. One way to ad-dress this is to apply a stochastic quasi-steady state assumption. However wemust to be careful when using this assumption. If the fast subsystem cannotreach a steady distribution fast enough, the quasi-steady-state assumptionwill propagate error into the simulation. To avoid these errors, we proposeto use the time dependent solution rather than the quasi-steady-state. Gen-erally speaking, the time dependent solution is not easy to derive for anarbitrary network. However, for some common motifs we do have time de-pendent solutions. We derive the time dependent solutions for these motifs,and then show how they can be used with tau-leaping to achieve substantialspeed-ups, including for a realistic model of blood coagulation. Although themethod is complicated, we have automated it. ∗Corresponding authorEmail addresses: [email protected] (Jin Fu), [email protected] (ShengWu), [email protected] (Linda R. Petzold) Preprint submitted to Journal of Computational PhysicsOctober 25, 2012
منابع مشابه
The numerical stability of leaping methods for stochastic simulation of chemically reacting systems.
Tau-leaping methods have recently been proposed for the acceleration of discrete stochastic simulation of chemically reacting systems. This paper considers the numerical stability of these methods. The concept of stochastic absolute stability is defined, discussed, and applied to the following leaping methods: the explicit tau, implicit tau, and trapezoidal tau.
متن کامل$S$-Leaping: An adaptive, accelerated stochastic simulation algorithm, bridging $\tau$-leaping and $R$-leaping
We propose the S-leaping algorithm for the acceleration of Gillespie’s stochastic simulation algorithm that combines the advantages of the two main accelerated methods; the τ -leaping and R-leaping algorithms. These algorithms are known to be efficient under different conditions; the τ -leaping is efficient for non-stiff systems or systems with partial equilibrium, while the R-leaping performs ...
متن کاملHighly accurate tau-leaping methods with random corrections.
We aim to construct higher order tau-leaping methods for numerically simulating stochastic chemical kinetic systems in this paper. By adding a random correction to the primitive tau-leaping scheme in each time step, we greatly improve the accuracy of the tau-leaping approximations. This gain in accuracy actually comes from the reduction in the local truncation error of the scheme in the order o...
متن کاملApproximate Exponential Algorithms to Solve the Chemical Master Equation
This paper discusses new simulation algorithms for stochastic chemical kinetics that exploit the linearity of the chemical master equation and its matrix exponential exact solution. These algorithms make use of various approximations of the matrix exponential to evolve probability densities in time. A sampling of the approximate solutions of the chemical master equation is used to derive accele...
متن کاملError Analysis of tau-leap simulation methods
We perform an error analysis for numerical approximation methods of continuous time Markov chain models commonly found in the chemistry and biochemistry literature. The motivation for the analysis is to be able to compare the accuracy of different approximation methods and, specifically, Euler tau-leaping and midpoint tau-leaping. We perform our analysis under a scaling in which the size of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Physics
دوره 235 شماره
صفحات -
تاریخ انتشار 2013